Isomorphism relations on computable structures
نویسندگان
چکیده
منابع مشابه
Isomorphism relations on computable structures
We study the complexity of the isomorphism relation on classes of computable structures. We use the notion of FF -reducibility introduced in [9] to show completeness of the isomorphism relation on many familiar classes in the context of all Σ1 equivalence relations on hyperarithmetical subsets of ω.
متن کاملIsomorphism and Bi-Embeddability Relations on Computable Structures∗
We study the complexity of natural equivalence relations on classes of computable structures such as isomorphism and bi-embeddability. We use the notion of tc-reducibility to show completeness of the isomorphism relation on many familiar classes in the context of all Σ1 equivalence relations on hyperarithmetical subsets of ω. We also show that the bi-embeddability relation on an appropriate hyp...
متن کاملRelations on computable structures
Gődel’s incompleteness theorem from 1931 is an astonishing early result of computable mathematics. Gődel showed that “there are in fact relatively simple problems in the theory of ordinary whole numbers which cannot be decided from the axioms.” The work of Gődel, Turing, Kleene, Church, Post and others in the mid-1930’s established the rigorous mathematical foundations for the computability the...
متن کاملDegree spectra of relations on computable structures
§0. Introduction. There has been increasing interest over the last few decades in the study of the effective content of Mathematics. One field whose effective content has been the subject of a large body of work, dating back at least to the early 1960s, is model theory. (A valuable reference is the handbook [7]. In particular, the introduction and the articles by Ershov and Goncharov and by Har...
متن کاملEffectively Nowhere Simple Relations on Computable Structures
Let A be a computable structure and let R be an additional relation on its domain. The notion of “quasi-simplicity” of R on A, first studied by G. Hird, is analogous to the computabilitytheoretic notion of simplicity, given the definability of various subrelations of ¬R. In the present paper, we define corresponding versions of the notions “nowhere simple” and “effectively nowhere simple.” We e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Symbolic Logic
سال: 2012
ISSN: 0022-4812,1943-5886
DOI: 10.2178/jsl/1327068695